0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.15 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.16/0.36 % Computer : n007.cluster.edu 0.16/0.36 % Model : x86_64 x86_64 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.16/0.36 % Memory : 8042.1875MB 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.16/0.36 % CPULimit : 1200 0.16/0.36 % WCLimit : 120 0.16/0.36 % DateTime : Tue Jul 13 13:06:49 EDT 2021 0.16/0.36 % CPUTime : 0.16/0.36 % Number of cores: 8 0.16/0.37 % Python version: Python 3.6.8 0.16/0.37 # Version: 2.6rc1-ho 0.16/0.38 # No SInE strategy applied 0.16/0.38 # Trying AutoSched0 for 59 seconds 0.42/0.62 # AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y 0.42/0.62 # and selection function SelectMaxLComplexAvoidPosPred. 0.42/0.62 # 0.42/0.62 # Preprocessing time : 0.086 s 0.42/0.62 0.42/0.62 # Proof found! 0.42/0.62 # SZS status Theorem 0.42/0.62 # SZS output start CNFRefutation 0.42/0.62 thf(fact_35_RES__bind__choose, axiom, ![X66:a, X20:set_a, X22:refine432681134nres_b, X67:a > refine432681134nres_b]:(member_a @ X66 @ X20=>(ord_le527798542nres_b @ X22 @ (refine436832839nd_a_b @ (refine1198353288_RES_a @ X20) @ X67)<=ord_le527798542nres_b @ X22 @ (X67 @ X66))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_35_RES__bind__choose)). 0.42/0.62 thf(conj_0, conjecture, ord_le527798542nres_b @ m @ (refine436832839nd_a_b @ (refine1198353288_RES_a @ (collect_a @ phi)) @ f), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.42/0.62 thf(fact_1_assms_I2_J, axiom, ord_le527798542nres_b @ m @ (f @ x), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_1_assms_I2_J)). 0.42/0.62 thf(fact_107_mem__Collect__eq, axiom, ![X225:a, X226:a > $o]:(member_a @ X225 @ (collect_a @ X226)<=>X226 @ X225), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_107_mem__Collect__eq)). 0.42/0.62 thf(fact_0_assms_I1_J, axiom, phi @ x, file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0_assms_I1_J)). 0.42/0.62 thf(c_0_5, plain, ![X66:a, X20:set_a, X22:refine432681134nres_b, X67:a > refine432681134nres_b]:(member_a @ X66 @ X20=>(ord_le527798542nres_b @ X22 @ (X67 @ X66)=>ord_le527798542nres_b @ X22 @ (refine436832839nd_a_b @ (refine1198353288_RES_a @ X20) @ X67))), inference(fof_simplification,[status(thm)],[fact_35_RES__bind__choose])). 0.42/0.62 thf(c_0_6, plain, ![X1939:a, X1940:set_a, X1941:refine432681134nres_b, X1942:a > refine432681134nres_b]:(~member_a @ X1939 @ X1940|(~ord_le527798542nres_b @ X1941 @ (X1942 @ X1939)|ord_le527798542nres_b @ X1941 @ (refine436832839nd_a_b @ (refine1198353288_RES_a @ X1940) @ X1942))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])). 0.42/0.62 thf(c_0_7, negated_conjecture, ~ord_le527798542nres_b @ m @ (refine436832839nd_a_b @ (refine1198353288_RES_a @ (collect_a @ phi)) @ f), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.42/0.62 thf(c_0_8, plain, ![X1:refine432681134nres_b, X44:a > refine432681134nres_b, X18:set_a, X5:a]:(ord_le527798542nres_b @ X1 @ (refine436832839nd_a_b @ (refine1198353288_RES_a @ X18) @ X44)|~member_a @ X5 @ X18|~ord_le527798542nres_b @ X1 @ (X44 @ X5)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.42/0.62 thf(c_0_9, plain, ord_le527798542nres_b @ m @ (f @ x), inference(split_conjunct,[status(thm)],[fact_1_assms_I2_J])). 0.42/0.62 thf(c_0_10, negated_conjecture, ~ord_le527798542nres_b @ m @ (refine436832839nd_a_b @ (refine1198353288_RES_a @ (collect_a @ phi)) @ f), inference(split_conjunct,[status(thm)],[c_0_7])). 0.42/0.62 thf(c_0_11, plain, ![X18:set_a]:(ord_le527798542nres_b @ m @ (refine436832839nd_a_b @ (refine1198353288_RES_a @ X18) @ f)|~member_a @ x @ X18), inference(spm,[status(thm)],[c_0_8, c_0_9])). 0.42/0.62 thf(c_0_12, plain, ![X2141:a, X2142:a > $o]:((~member_a @ X2141 @ (collect_a @ X2142)|X2142 @ X2141)&(~X2142 @ X2141|member_a @ X2141 @ (collect_a @ X2142))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_107_mem__Collect__eq])])). 0.42/0.62 thf(c_0_13, negated_conjecture, ~member_a @ x @ (collect_a @ phi), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.42/0.62 thf(c_0_14, plain, ![X8:a > $o, X5:a]:(member_a @ X5 @ (collect_a @ X8)|~X8 @ X5), inference(split_conjunct,[status(thm)],[c_0_12])). 0.42/0.62 thf(c_0_15, plain, phi @ x, inference(split_conjunct,[status(thm)],[fact_0_assms_I1_J])). 0.42/0.62 thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])]), ['proof']). 0.42/0.62 # SZS output end CNFRefutation 0.42/0.62 # Proof object total steps : 17 0.42/0.62 # Proof object clause steps : 8 0.42/0.62 # Proof object formula steps : 9 0.42/0.62 # Proof object conjectures : 5 0.42/0.62 # Proof object clause conjectures : 3 0.42/0.62 # Proof object formula conjectures : 2 0.42/0.62 # Proof object initial clauses used : 5 0.42/0.62 # Proof object initial formulas used : 5 0.42/0.62 # Proof object generating inferences : 3 0.42/0.62 # Proof object simplifying inferences : 2 0.42/0.62 # Training examples: 0 positive, 0 negative 0.42/0.62 # Parsed axioms : 503 0.42/0.62 # Removed by relevancy pruning/SinE : 0 0.42/0.62 # Initial clauses : 971 0.42/0.62 # Removed in clause preprocessing : 284 0.42/0.62 # Initial clauses in saturation : 687 0.42/0.62 # Processed clauses : 938 0.42/0.62 # ...of these trivial : 57 0.42/0.62 # ...subsumed : 217 0.42/0.62 # ...remaining for further processing : 664 0.42/0.62 # Other redundant clauses eliminated : 159 0.42/0.62 # Clauses deleted for lack of memory : 0 0.42/0.62 # Backward-subsumed : 8 0.42/0.62 # Backward-rewritten : 22 0.42/0.62 # Generated clauses : 3749 0.42/0.62 # ...of the previous two non-trivial : 2978 0.42/0.62 # Contextual simplify-reflections : 18 0.42/0.62 # Paramodulations : 3473 0.42/0.62 # Factorizations : 10 0.42/0.62 # NegExts : 33 0.42/0.62 # Equation resolutions : 173 0.42/0.62 # Propositional unsat checks : 0 0.42/0.62 # Propositional check models : 0 0.42/0.62 # Propositional check unsatisfiable : 0 0.42/0.62 # Propositional clauses : 0 0.42/0.62 # Propositional clauses after purity: 0 0.42/0.62 # Propositional unsat core size : 0 0.42/0.62 # Propositional preprocessing time : 0.000 0.42/0.62 # Propositional encoding time : 0.000 0.42/0.62 # Propositional solver time : 0.000 0.42/0.62 # Success case prop preproc time : 0.000 0.42/0.62 # Success case prop encoding time : 0.000 0.42/0.62 # Success case prop solver time : 0.000 0.42/0.62 # Current number of processed clauses : 606 0.42/0.62 # Positive orientable unit clauses : 62 0.42/0.62 # Positive unorientable unit clauses: 0 0.42/0.62 # Negative unit clauses : 19 0.42/0.62 # Non-unit-clauses : 525 0.42/0.62 # Current number of unprocessed clauses: 2668 0.42/0.62 # ...number of literals in the above : 9680 0.42/0.62 # Current number of archived formulas : 0 0.42/0.62 # Current number of archived clauses : 38 0.42/0.62 # Clause-clause subsumption calls (NU) : 44305 0.42/0.62 # Rec. Clause-clause subsumption calls : 33581 0.42/0.62 # Non-unit clause-clause subsumptions : 212 0.42/0.62 # Unit Clause-clause subsumption calls : 2358 0.42/0.62 # Rewrite failures with RHS unbound : 0 0.42/0.62 # BW rewrite match attempts : 22 0.42/0.62 # BW rewrite match successes : 6 0.42/0.62 # Condensation attempts : 0 0.42/0.62 # Condensation successes : 0 0.42/0.62 # Termbank termtop insertions : 105171 0.42/0.62 0.42/0.62 # ------------------------------------------------- 0.42/0.62 # User time : 0.244 s 0.42/0.62 # System time : 0.011 s 0.42/0.62 # Total time : 0.255 s 0.42/0.62 # Maximum resident set size: 2792 pages 0.42/0.62 EOF